# -*- coding: UTF-8 -*-
from typing import List
from leetcode_helper import TestcaseHelper, SolutionBase


class Solution(SolutionBase):
    # 解题的方法，命名和Leetcode的保持一致即可
    def minMoves(self, target: int, maxDoubles: int) -> int:
        ans = 0
        double_count = 0

        if maxDoubles == 0:
            return target - 1

        while target > 1:
            if double_count < maxDoubles:
                if target % 2 == 1:
                    ans += 1
                    target = target - 1
                else:
                    ans += 1
                    target = target / 2
                    double_count += 1
            else:
                ans = ans + target - 1
                break

        return ans


if __name__ == '__main__':
    solution = Solution()

    # 按照leetcode的题目说明，将基本的test case填入
    # 每条case的最后一个元素是正确的结果，即期待的结果
    # 使用元组来保存输入的数据，期待的结果
    testcases = [
        (5, 0, 4),
        (19, 2, 7),
        (10, 4, 4)
    ]

    for case_item in testcases:
        # 获取测试用的case和期待的执行结果
        input1 = case_item[0]
        input2 = case_item[1]

        expect = case_item[len(case_item) - 1]

        exec_result = solution.minMoves(input1, input2)

        # 判断执行结果，输出提示信息
        check_result = solution.check_result(expect, exec_result)
        TestcaseHelper.print_case(check_result, case_item, exec_result)

